Efficient Computation in Groups and Simplicial Complexes
نویسندگان
چکیده
منابع مشابه
Efficient Computation in Groups and Simplicial Complexes
Using HNN extensions of the Boone-Britton group, a group E is obtained which simulates Turing machine computation in linear space and cubic time. Space in E is measured by the length of words, and time by the number of substitutions of defining relators and conjugations by generators required to convert one word to another. The space bound is used to derive a PSPACE-complete problem for a topol...
متن کاملCritical Groups of Simplicial Complexes
We generalize the theory of critical groups from graphs to simplicial complexes. Specifically, given a simplicial complex, we define a family of abelian groups in terms of combinatorial Laplacian operators, generalizing the construction of the critical group of a graph. We show how to realize these critical groups explicitly as cokernels of reduced Laplacians, and prove that they are finite, wi...
متن کاملHomology Groups of Simplicial Complexes in R 3 1
Recent developments in analyzing molecular structures and representing solid models using simplicial complexes have further enhanced the need for computing structural information about simplicial complexes in R 3. This paper develops basic techniques required to manipulate and analyze structures of complexes in R 3. A new approach to analyze simplicial complexes in Euclidean 3-space R 3 is desc...
متن کاملComputation of Cohomology Operations on Finite Simplicial Complexes
We propose a method for calculating cohomology operations for finite simplicial complexes. Of course, there exist well–known methods for computing (co)homology groups, for example, the “reduction algorithm” consisting in reducing the matrices corresponding to the differential in each dimension to the Smith normal form, from which one can read off (co)homology groups of the complex [Mun84], or t...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1983
ISSN: 0002-9947
DOI: 10.2307/1999079